The visibility graph of congruent discs is Hamiltonian
نویسنده
چکیده
We show that the visibility graph of a set of disjoint congruent discs in IR is Hamiltonian, as long as the discs are not all supported by the same line. The proof is constructive, and leads to efficient algorithms for obtaining a Hamilton circuit.
منابع مشابه
Geometric-Arithmetic Index of Hamiltonian Fullerenes
A graph that contains a Hamiltonian cycle is called a Hamiltonian graph. In this paper we compute the first and the second geometric – arithmetic indices of Hamiltonian graphs. Then we apply our results to obtain some bounds for fullerene.
متن کاملEpileptic seizure detection based on The Limited Penetrable visibility graph algorithm and graph properties
Introduction: Epileptic seizure detection is a key step for both researchers and epilepsy specialists for epilepsy assessment due to the non-stationariness and chaos in the electroencephalogram (EEG) signals. Current research is directed toward the development of an efficient method for epilepsy or seizure detection based the limited penetrable visibility graph (LPVG) algorith...
متن کاملOn the visibility graph of convex translates
We show that the visibility graph of a set of non-intersecting translates of the same compact convex object in R always contains a Hamiltonian path. Furthermore, we show that every other edge in the Hamiltonian path can be used to obtain a perfect matching that is realized by a set of non-intersecting lines of sight. ? 2001 Elsevier Science B.V. All rights reserved.
متن کاملSegment endpoint visibility graphs are hamiltonian
We show that the segment endpoint visibility graph of any finite set of disjoint line segments in the plane admits a simple Hamiltonian polygon, if not all segments are collinear. This proves a conjecture of Mirzaian.
متن کاملOn sequential triangulations of simple polygons
A triangulation is said to be Hamiltonian if its dual graph contains a Hamiltonian path. A sequential triangulation is a Hamiltonian triangulation having the additional property that the “turns” in the Hamiltonian path alternate left/right. Such triangulations are useful in computer graphics rendering and are related to a new type of two-guard walk. In this paper we present a simple algorithm t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 25 شماره
صفحات -
تاریخ انتشار 2003